package algorithm.leetcode.q867;

import java.util.ArrayList;
import java.util.HashMap;

public class Solution {
    public static int[][] transpose(int[][] A) {
        double a = 314e-2;
        double b = 314E2;
        String c = String.valueOf(1);
        c=new Integer(1).toString();
        System.out.println(b);
        System.out.println(a);
        System.out.println(1-0.1-0.1);
        HashMap map = new HashMap();
        ArrayList arrayList = null;
        int[][] result = new int[A[0].length][A.length];
        for (int i = 0; i <A[0].length; i++) {
            for (int j=0;j< A.length;j++){
                result[j][i]=A[i][j];
            }
        }
        return result;
    }

    public static void main(String[] args) {
        int[][] a = {{1,2,3}, {4, 5, 6}, {7, 8, 9}};
        int[][] transpose = transpose(a);
        System.out.println(transpose);

    }
}
class A{
     static void test(){
    }
}

